Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing

Propositional satisfiability (SAT) was the first decision problem to be shown nondeterministic polynomial (NP) complete and has been the subject of remarkable theoretical work over the years. Moreover, SAT and extensions of SAT find many practical applications, including planning, software and hardware model checking, bioinformatics, equivalence check ing, test-pattern generation, software package installation, and cryptography. The annual SAT conference is now widely recognized as “the venue” for publishing the latest advances in SAT research. This year marked the tenth SAT meeting. The conference was held in Lisbon, Portugal, from May 28 through May 31, 2007. The area of SAT is interpreted in a broad sense to include not just propositional satisfiability, but also pseudoBoolean (PB) constraint solving and optimization, quantified Boolean formulae (QBF), constraint programming (CP) techniques for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). Submissions were solicited for original research on proof systems and proof complexity, search algorithms and heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers and tools, case studies and empirical results. The conference attracted 80 participants, from academe and industry— attendance that made the 2007 meeting one of the largest SAT conferences in terms of attendance. The conference included a comprehensive social program to stimulate communication and exchange of ideas among conference participants. Reports